279B - Books - CodeForces Solution


binary search brute force implementation two pointers *1400

Please click on ads to support us..

Python Code:



n, t = map(int, input().split(" "))
a = list(map(int, input().split(" ")))

left = 0
ans = 0
current_sum = 0
for i in range(n):
    current_sum += a[i]
    while (current_sum > t):
        current_sum -= a[left]
        left += 1
    if (ans < i - left + 1):
        ans = i - left + 1
print(ans)


        


Comments

Submit
0 Comments
More Questions

1437A - Marketing Scheme
1473B - String LCM
1374A - Required Remainder
1265E - Beautiful Mirrors
1296A - Array with Odd Sum
1385A - Three Pairwise Maximums
911A - Nearest Minimums
102B - Sum of Digits
707A - Brain's Photos
1331B - Limericks
305B - Continued Fractions
1165B - Polycarp Training
1646C - Factorials and Powers of Two
596A - Wilbur and Swimming Pool
1462B - Last Year's Substring
1608B - Build the Permutation
1505A - Is it rated - 2
169A - Chores
765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat